A k–nearest-neighbor simulator for daily precipitation and other weather variables
نویسندگان
چکیده
A multivariate, nonparametric time series simulation method is provided to generate random sequences of daily weather variables that “honor” the statistical properties of the historical data of the same weather variables at the site. A vector of weather variables (solar radiation, maximum temperature, minimum temperature, average dew point temperature, average wind speed, and precipitation) on a day of interest is resampled from the historical data by conditioning on the vector of the same variables (feature vector) on the preceding day. The resampling is done from the k nearest neighbors in state space of the feature vector using a weight function. This approach is equivalent to a nonparametric approximation of a multivariate, lag 1 Markov process. It does not require prior assumptions as to the form of the joint probability density function of the variables. An application of the resampling scheme with 30 years of daily weather data at Salt Lake City, Utah, is provided. Results are compared with those from the application of a multivariate autoregressive model similar to that of Richardson [1981].
منابع مشابه
Drought Monitoring and Prediction using K-Nearest Neighbor Algorithm
Drought is a climate phenomenon which might occur in any climate condition and all regions on the earth. Effective drought management depends on the application of appropriate drought indices. Drought indices are variables which are used to detect and characterize drought conditions. In this study, it was tried to predict drought occurrence, based on the standard precipitation index (SPI), usin...
متن کاملWeather analogue: A tool for real-time prediction of daily weather data realizations based on a modified k-nearest neighbor approach
Quantifying the response of any given system beyond their current condition to weather alone or together with other factors requires predicting realizations of future weather conditions. The predicted weather data should not only be sufficiently accurate, but also their time scale should be in accordance to the decision support system in which the studied system is being applied. Inclusion of p...
متن کاملFUZZY K-NEAREST NEIGHBOR METHOD TO CLASSIFY DATA IN A CLOSED AREA
Clustering of objects is an important area of research and application in variety of fields. In this paper we present a good technique for data clustering and application of this Technique for data clustering in a closed area. We compare this method with K-nearest neighbor and K-means.
متن کاملWeather Types and Rainfall over Senegal. Part II: Downscaling of GCM Simulations
Four methods of downscaling daily rainfall sequences from general circulation model (GCM) simulations are intercompared over Senegal, using a 13-station network of daily observations during July–September 1961–98. The local scaling method calibrates raw GCM daily rainfall at the closest grid point to a given station so that the climatological distribution of rainfall matches the observed one. T...
متن کاملAn Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification
The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...
متن کامل